Opacity generalised to transition systems
نویسندگان
چکیده
منابع مشابه
Opacity Generalized to Transition Systems
Recently, opacity has proved to be a very promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of opacity to the model of labelled transition systems and generalize opacity in order to be able to represent information flow security as well as protocol security. We give precise links between opacity and other...
متن کاملEnforcing opacity of regular predicates on modal transition systems
Given a labelled transition system LTS partially observed by an attacker, and a regular predicate Sec over the runs of LTS, enforcing opacity of the secret Sec in LTS means computing a supervisory controller K such that an attacker who observes a run of K/LTS cannot ascertain that the trace of this run belongs to Sec based on the knowledge of LTS and K. We lift the problem from a single labelle...
متن کاملOpacity of nondeterministic transition systems: A (bi)simulation relation approach
In this paper, we propose several opacity-preserving (bi)simulation relations for general nondeterministic transition systems (NTS) in terms of initial-state opacity, current-state opacity, K-step opacity, and infinite-step opacity. We also show how one can leverage quotient construction to compute such relations. In addition, we use a two-way observer method to verify opacity of nondeterminist...
متن کاملGeneralised Systems Approach to Modelling Atm Teletraffic
Teletraffic phenomenon in classical and new telecommunication networks can be more systematically described and different system-type problems can be effectively solved using fundamental concepts of systems and GSPS (General Systems Problem Solver) methodology. Basic presupposition is that general systems methodology is usable as a logicomathematical methodology in formulation, derivation and e...
متن کاملDeformation techniques to solve generalised Pham systems
In [25,42,6], the authors have shown that universal solving procedures require exponential running time. Roughly speaking, a universal solving procedure takes as input a system of multivariate polynomial equations and outputs complete symbolic information on the solution variety. Here, we introduce a non–universal solving procedure adapted to Generalised Pham Systems. The aim is to compute part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Security
سال: 2008
ISSN: 1615-5262,1615-5270
DOI: 10.1007/s10207-008-0058-x